3X3-as kosárlabda versenyek Debrecenben

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fullerene (C60) Adsorption and Films Growth on the (3x3) and (3x3) Surface of 6H SiC(0001)

Scanning tunneling microscopy (STM) was used to study the C60 adsorption on the Si rich (3x3) and C rich (43x43) surface of 6H-SiC(0001). At room temperature, triangular or hexagonal islands commensurating to the substrate structure at submonlayer coverages were observed. One of the interesting observations was the nucleation of the second layer of the C60 molecule^ even at submonlayer coverage...

متن کامل

Efficient 3x3 Median Filter Computations

This Paper presents an efficient algorithm for median filtering with a 3x3 filter kernel with only about 9 comparisons per pixel using spatial coherence between neighbouring filter computations. The basic algorithm calculates two medians in one step and reuses sorted slices of three vertical neighbouring pixels. An extension of this algorithm for 2D spatial coherence is also examined, which cal...

متن کامل

Generalized Schur Numbers for x1 + x2 + c = 3x3

Let r(c) be the least positive integer n such that every two coloring of the integers 1, . . . , n contains a monochromatic solution to x1 + x2 + c = 3x3. Verifying a conjecture of Martinelli and Schaal, we prove that r(c) = ⌈ 2⌈ 3 ⌉+ c 3 ⌉

متن کامل

An Alternate Algorithm for (3x3) Median Filtering of Digital Images

Median filtering is a commonly used technique in image processing. The main problem of the median filter is its high computational cost (for sorting N pixels, the temporal complexity is O(N·log N), even with the most efficient sorting algorithms). When the median filter must be carried out in real time, the software implementation in general-purpose processors does not usually give good results...

متن کامل

A Complete Set of Unitary Invariants for 3x3 Complex Matrices

is a complete set of unitary invariants for any wX» complex matrix A. The author was able to improve this result by demonstrating in [3] that for re fixed but arbitrary, there is always a subset of the above collection containing fewer than 24" traces which serves as a complete set of unitary invariants for «X» matrices. It is of interest to discover the sharpness of the above upper bound on th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Engineering and Management Sciences

سال: 2018

ISSN: 2498-700X

DOI: 10.21791/ijems.2018.5.24.